Rabin-$p$ Cryptosystem: Practical and Efficient Method for Rabin based Encryption Scheme
نویسندگان
چکیده
In this work, we introduce a new, efficient and practical scheme based on the Rabin cryptosystem without using the Jacobi symbol, message redundancy technique or the needs of extra bits in order to specify the correct plaintext. Our system involves only a single prime number as the decryption key and does only one modular exponentiation. Consequently, this will practically reduce the computational efforts during decryption process. We demonstrate that the decryption is unique and proven to be equivalent to factoring.The scheme is performs better when compared to a number of Rabin cryptosystem variants.
منابع مشابه
A Practical Public Key Cryptosystem from Paillier and Rabin Schemes
We propose a practical scheme based on factoring and semantically secure (IND-CPA) in the standard model. The scheme is obtained from a modification of the so called RSA-Paillier [5] scheme. This modification is reminiscent of the ones applied by Rabin [22] and Williams [25] to the well-known RSA cryptosystem. Thanks to the special properties of such schemes, we obtain efficiency similar to tha...
متن کاملAnalysis of Rabin and Rabin-P Cryptosystem for specifying correct plain text
This work, introduced a new, competent and useful scheme based on the Rabin cryptosystem without using the Jacobi symbol [1], message redundancy technique or the needs of extra bits in order to specify the correct plaintext. This system involves only a single prime number. This also analysed and discussed the comparison between the old system and the new system with suitable examples and result...
متن کاملOblivious Transfer via McEliece's PKC and Permuted Kernels
We present two efficient protocols for two flavors of oblivious transfer (OT): the Rabin and 1-out-of-2 OT using the McEliece cryptosystem and Shamir’s zero-knowledge identification scheme based on permuted kernels. This is a step towards diversifying computational assumptions on which OT – the primitive of central importance – can be based. Although we obtain a weak version of Rabin OT (where ...
متن کاملA New Efficient Asymmetric Cryptosystem Based on the Square Root Problem
The square root modulo problem is a known primitive in designing an asymmetric cryptosystem. It was first attempted by Rabin. Decryption failure of the Rabin cryptosystem caused by the 4-to-1 decryption output is overcome efficiently in this work. The proposed scheme (known as the AAβcryptosystem) has its encryption speed having a complexity order faster than the Diffie-Hellman Key Exchange, El...
متن کاملEnhancements of the Non-linear Knapsack Cryptosystem
Nowadays all existing public key cryptosystems are classified into three categories relied on different mathematical foundations. The first one is based on the difficulty of factoring the product of two big prime numbers. The representatives are the RSA and the Rabin cryptosystems. The second one such as the ElGamal cryptosystem is based on the discrete logarithm problem. The last one is based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1411.4398 شماره
صفحات -
تاریخ انتشار 2014